Reduction Based Symbolic Value Partition
نویسندگان
چکیده
The symbolic value partition problem is more general than the reduct problem and more complicated than the discretization problem. In this paper, we point out that the symbolic value partition problem can be converted into a series of reduct problems and propose an algorithm called reduction based symbolic value partition (RBSVP) whose all possible outputs form the set of all partition reducts. The optimal substructure property of the optimal symbolic value partition (OSVP) problem indicate the setting for obtaining a suboptimal solution. Experimental results show that the algorithm can help computing smaller rule sets with better coverage.
منابع مشابه
Rough sets approach to symbolic value partition
Symbolic value partition refers to the problem of dividing each attribute domain of a data table into a family of disjoint subsets. It could help obtaining a new data table with less attributes and smaller attribute domains, thus facilitating further machine learning processing. The optimal symbolic value partition (OSVP) problem of supervised data, where the optimal metric is defined by the ca...
متن کاملSplitting Trees and Partition Refinement in Real-Time Model Checking
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike often used canonical representations, this representation is tai...
متن کاملSymbolic OBDD Assembly Sequence Planning Algorithm Based on Unordered Partition with 2 Parts of a Positive Integer
To improve solution efficiency and automation of assembly sequence planning, a symbolic ordered binary decision diagram (OBDD) technique for assembly sequence planning problem based on unordered partition with 2 parts of a positive integer is proposed. To convert the decomposition of assembly liaison graph into solving unordered partition with 2 parts of positive integer N, a transformation met...
متن کاملAn Efficient Fully Symbolic Bisimulation Algorithm for Non-Deterministic Systems
The definition of bisimulation suggests a partition-refinement step, which we show to be suitable for a saturation-based implementation. We compare our fully symbolic saturation-based implementation with the fastest extant bisimulation algorithms over a set of benchmarks, and conclude that it appears to be the fastest algorithm capable of computing the largest bisimulation over very large quoti...
متن کاملExtended SAX: Extension of Symbolic Aggregate Approximation for Financial Time Series Data Representation
Efficient and accurate similarity searching for a large amount of time series data set is an important but non-trivial problem. Many dimensionality reduction techniques have been proposed for effective representation of time series data in order to realize such similarity searching, including Singular Value Decomposition (SVD), the Discrete Fourier transform (DFT), the Adaptive Piecewise Consta...
متن کامل